Permutation polytopes corresponding to strongly supermodular functions
نویسندگان
چکیده
منابع مشابه
Permutation polytopes corresponding to strongly supermodular functions
Throughout, let p be a positive integer and let be the set of permutations over {1; : : : ; p}. A real-valued function over subsets of {1; : : : ; p}, with (∅)=0, de7nes a mapping of into R where ∈ is mapped into the vector whose kth coordinate ( )k is the augmented -value obtained from adding k to the coordinates that precede it, according to the ranking induced by . The permutation polytope c...
متن کاملSupermodular Functions on Finite Lattices
The supermodular order on multivariate distributions has many applications in financial and actuarial mathematics. In the particular case of finite, discrete distributions, we generalize the order to distributions on finite lattices. In this setting, we focus on the generating cone of supermodular functions because the extreme rays of that cone (modulo the modular functions) can be used as test...
متن کاملPermutation Polytopes of Cyclic Groups
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. In the situation that the generator of the group consists of at most two orbits, we can give a complete combinatorial description of the associated permutation polytope. In the case of three orbits the facet structure is...
متن کاملPermutation polytopes and indecomposable elements in permutation groups
Each group G of n × n permutation matrices has a corresponding permutation polytope, P (G) := conv(G) ⊂ R. We relate the structure of P (G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then min{2t, ⌊n/2⌋} is a sharp upper bound on the diameter of the graph of P (G). We also show that P (G) achieves its maximal dimension of (n − 1) precisely when G is 2-tra...
متن کاملGreedy Minimization of Weakly Supermodular Set Functions
This paper defines weak-α-supermodularity for set functions. It shows that minimizing such functions under cardinality constrains is a common task in machine learning and data mining. Moreover, any problem whose objective function exhibits this property benefits from a greedy extension phase. Explicitly, let S∗ be the optimal set of cardinality k that minimizes f and let S0 be an initial soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2002.11.010